pre-scheduling and scheduling of task graph on homogeneous multiprocessor systems

نویسندگان

marjan abdeyazdan

saeed parsa

amir masoud rahmani

چکیده

task graph scheduling is a multi-objective optimization and np-hard problem. in this paper a new algorithm on homogeneous multiprocessors systems is proposed. basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. these two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the other one. the problem is to achieve the trade-off between these two parameters. pre-scheduling algorithms are mainly aimed at modifying the structure of task graph to gain optimal scheduling. in the proposed algorithm the suitable number of processors for scheduling the task graph is computed. the idea of nash equilibrium is mainly applied to compute the appropriate number of processors in such a way that the idle time of the processors is reduced while their processing power is increased. also, considering the communication costs and interdependencies, the tasks are merged as their earliest start time is reduced. in this way, the length of the critical path is reduced while the degree of parallelism is increased and ultimately the completion time is reduced.our experimental result on a number of known benchmark graphs demonstrates the effect of our proposed algorithm.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems

Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...

متن کامل

Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems

Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...

متن کامل

Energy-Efficient Scheduling for Homogeneous Multiprocessor Systems

We present a number of novel algorithms, based on mathematical optimization formulations, in order to solve a homogeneous multiprocessor scheduling problem, while minimizing the total energy consumption. In particular, for a system with a discrete speed set, we propose solving a tractable linear program. Our formulations are based on a fluid model and a global scheduling scheme, i.e. tasks are ...

متن کامل

Efficient Task Scheduling Heuristic for Multiprocessor Systems

The problem of assigning and scheduling parallel job tasks onto multiple processing elements is a complex one and has resulted in numerous heuristics aimed at approximating an optimal solution. A heuristic based on the well known list scheduling is proposed here. Dubbed Rule-List Scheduling (RLS), it compares well against other heuristics when using program total completion time as a metric. In...

متن کامل

General Multiprocessor Task Scheduling

Most papers in the scheduling field assume that a job can be processed by only one machine at a time. Namely, they use a one-job-on-one-machine model. In many industry settings, this may not be an adequate model. Motivated by human resource planning, diagnosable microprocessor systems, berth allocation, and manufacturing systems that may require several resources simultaneously to process a job...

متن کامل

Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems

Scheduling program tasks on processors is at the core of the efficient use of multiprocessor systems. Most task scheduling problems are known to be NP-Hard and, thus, heuristics are the method of choice in all but the simplest cases. The utilization of acknowledged sets of benchmark-problem instances is essential for the correct comparison and analysis of heuristics. Yet, such sets are not avai...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
journal of advances in computer research

ناشر: sari branch, islamic azad university

ISSN 2345-606X

دوره 4

شماره 1 2013

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023